منابع مشابه
On the Trivial Many Sorted Algebras and Many Sorted Congruences
In this paper a, I denote sets and S denotes a non empty non void many sorted signature. The scheme MSSExD deals with a non empty set A and a binary predicate P , and states that: There exists a many sorted set f indexed by A such that for every element i of A holds P [i, f (i)] provided the following condition is met: • For every element i of A there exists a set j such that P [i, j]. Let I be...
متن کاملMany - Sorted Natural Semantics
We present an extension of natural semantics which can be used to describe the static semantics of imperative and object-oriented programming languages. Furthermore we show that the semantic analysis can be generated from these descriptions. As a side eeect, we get a precise deenition of which properties of a programming language are statically decidable and which properties can only be checked...
متن کاملConnecting Many-Sorted Theories
Basically, the connection of two many-sorted theories is obtained by taking their disjoint union, and then connecting the two parts through connection functions that must behave like homomorphisms on the shared signature. We determine conditions under which decidability of the validity of universal formulae in the component theories transfers to their connection. In addition, we consider varian...
متن کاملMany-sorted Sets
The article deals with parameterized families of sets. When treated in a similar way as sets (due to systematic overloading notation used for sets) they are called many sorted sets. For instance, if x and X are two many-sorted sets (with the same set of indices I) then relation x ∈ X is defined as ∀i∈Ixi ∈ Xi. I was prompted by a remark in a paper by Tarlecki and Wirsing: “Throughout the paper ...
متن کاملMany Sorted Algebras
The basic purpose of the paper is to prepare preliminaries of the theory of many sorted algebras. The concept of the signature of a many sorted algebra is introduced as well as the concept of many sorted algebra itself. Some auxiliary related notions are defined. The correspondence between (1 sorted) universal algebras [8] and many sorted algebras with one sort only is described by introducing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2021
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2021.100644